By means of partial reconfiguration, parts of the hardware can be dynamically exchanged at runtime. This allows that streaming\r\napplication running in different modes of the systems can share resources. In this paper, we discuss the architectural issues to design\r\nsuch reconfigurable systems. For being able to reduce reconfiguration time, this paper furthermore proposes a novel algorithm to\r\naggregate several streaming applications into a single representation, called merge graph. The paper also proposes an algorithm to\r\nplace streaming application at runtime which not only considers the placement and communication constraints, but also allows to\r\nplace merge tasks. In a case study, we implement the proposed algorithm as runtime support on an FPGA-based system on chip.\r\nFurthermore, experiments show that reconfiguration time can be considerably reduced by applying our approach.
Loading....